Preconditioning Markov Chain Monte Carlo Method for Geomechanical Subsidence using multiscale method and machine learning technique
نویسندگان
چکیده
In this paper, we consider the numerical solution of poroelasticity problem with stochastic properties. We present a Two-stage Markov Chain Monte Carlo method for geomechanical subsidence. work, study two techniques preconditioning: (MS) multiscale model order reduction and (ML) machine learning technique. The purpose preconditioning is fast sampling, where new proposal first tested by cheap solver or using prediction neural network full fine grid computations will be conducted only if passes step. To construct reduced model, use Generalized Multiscale Finite Element Method construction basis functions pressure displacements in fields. to based preconditioning, generate dataset it train networks. Karhunen–Loéve expansion used represent realization field. Numerical results are presented two- three-dimensional examples.
منابع مشابه
An Adaptive Markov Chain Monte Carlo Method for GARCH Model
We propose a method to construct a proposal density for the Metropolis-Hastings algorithm in Markov Chain Monte Carlo (MCMC) simulations of the GARCH model. The proposal density is constructed adaptively by using the data sampled by the MCMC method itself. It turns out that autocorrelations between the data generated with our adaptive proposal density are greatly reduced. Thus it is concluded t...
متن کاملA Markov-Chain-Monte-Carlo-Based Method for System Identification
This paper describes a novel methodology for the identification of mechanical systems and structures from vibration response measurements. It combines prior information, observational data and predictive finite element models to produce configurations and system parameter values that are most consistent with the available data and model. Bayesian inference and a Metropolis simulation algorithm ...
متن کاملEnsemble preconditioning for Markov chain Monte Carlo simulation
We describe parallel Markov chain Monte Carlo methods that propagate a collective ensemble of paths, with local covariance information calculated from neighboring replicas. The use of collective dynamics eliminates multiplicative noise and stabilizes the dynamics thus providing a practical approach to difficult anisotropic sampling problems in high dimensions. Numerical experiments with model p...
متن کاملMarkov chain Monte Carlo method without detailed balance.
We present a specific algorithm that generally satisfies the balance condition without imposing the detailed balance in the Markov chain Monte Carlo. In our algorithm, the average rejection rate is minimized, and even reduced to zero in many relevant cases. The absence of the detailed balance also introduces a net stochastic flow in a configuration space, which further boosts up the convergence...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2021
ISSN: ['0377-0427', '1879-1778', '0771-050X']
DOI: https://doi.org/10.1016/j.cam.2021.113420